Перевод: с английского на все языки

со всех языков на английский

state transition function

См. также в других словарях:

  • Transition function — In mathematics, a transition function has several different meanings:* In topology, a transition function is a homeomorphism from one coordinate chart to another. Given two charts ( U i , φ i ) and ( U j , φ j ) a transition function normally… …   Wikipedia

  • transition function — noun A function from (state, input symbol) to state describing what state to move to on receiving a given input in a given state …   Wiktionary

  • State diagram — State diagrams is a diagram used in the field of computer science, representing the behavior of a system, which is composed of a finite number of states. There are many forms of state diagrams, which differ slightly and have different semantics.… …   Wikipedia

  • Transition — or transitional may refer to:*Transition (genetics) *Transitional fossil *Transition (grappling) *Transition metal *Transition state * Transition: an operation of a finite state machine *Transition function *Transition flying car *Transition… …   Wikipedia

  • Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… …   Wikipedia

  • State machine replication — Introduction from Schneider s 1990 survey: : Distributed software is often structured in terms of clients and services. Each service comprises one or more servers and exports operations that clients invoke by making requests. Although using a… …   Wikipedia

  • state machine — noun A formalism for describing computation, consisting of a set of states and a transition function describing when to move from one state to another. This algorithm will produce a state machine for parsing a given context free grammar. See Also …   Wiktionary

  • Finite state machine — A finite state machine (FSM) or finite state automaton (plural: automata ) or simply a state machine, is a model of behavior composed of a finite number of states, transitions between those states, and actions. A finite state machine is an… …   Wikipedia

  • Nondeterministic finite state machine — In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes …   Wikipedia

  • Nondeterministic finite-state machine — In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes …   Wikipedia

  • transition element — Chem. any element in any of the series of elements with atomic numbers 21 29, 39 47, 57 79, and 89 107, that in a given inner orbital has less than a full quota of electrons. Also called transition metal. [1920 25] * * * Any chemical element with …   Universalium

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»